Point matching under non-uniform distortions
نویسندگان
چکیده
منابع مشابه
Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm.
We developed maximum clique-based algorithms for spot matching for two-dimensional gel electrophoresis images, protein structure alignment and protein side-chain packing, where these problems are known to be NP-hard. Algorithms based on direct reductions to the maximum clique can find optimal solutions for instances of size (the number of points or residues) up to 50-150 using a standard PC. We...
متن کاملMatching of IC Patterns under Non-Uniform Illumination
The use of hierarchical Chamfer Matching (CM) to match die patterns on VLSI wafers for the alignment of semiconductor chips is presented. This method can extract images with non-umform lighting (without loss) for matching, and somehow it is invariant to some environment changes. Here, it is applied to align IC patterns under non-uniform lighting while the normalized correlation method fails. Ex...
متن کاملEfficient Colored Point Set Matching Under Noise
Let A and B be two colored point sets in R2, with |A| ≤ |B|. We propose a process for determining matches, in terms of the bottleneck distance, betweenA and subsets of B under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching alg...
متن کاملPartial Least-Squares Point Matching under Translations
We consider the problem of translating a given pattern set B of size m, and matching every point of B to some point of a larger ground set A of size n in an injective way, minimizing the sum of the squared distances between matched points. We show that when B can only be translated along a line, there can be at most m(n − m) + 1 different matchings as B moves along the line, and hence the optim...
متن کاملPersistent Homology under Non-uniform Error
Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classes. Prior work has shown that the homology and robustness information can be read off the extended persistence diagram of the function. This paper extends these results to a non-uniform error model in which perturbation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00282-2